Scheduling of Dynamic Tasks in Wireless Grid Computing Using Optimized Final Sternness Priority Rule (ofspr) Algorithm

Over the past several years, Grid computing is emerged as one of the most important and scalable alternatives to high performance supercomputing. Dynamic nature of grid computing is difficult to come up with near optimal solutions to effectively schedule the tasks in grids. This paper proposes a novel scheduling strategies and dynamically schedules the tasks by using Optimized final Sternness Priority Rule (OFSPR). When more than one job arrives at the same cycle time, Optimized Final Sternness Priority Rule (OFSPR) Algorithm is used at that moment. Simulation results presents that our approach is efficient for scheduling the tasks.